منابع مشابه
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in which entries can be represented as graph structures. In our method, the topological structure of a graph as well as that of its subgraphs are represented as vectors whose components correspond to the sorted laplacian...
متن کاملTHE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
متن کاملOn the Laplacian Spectra of Graphs
We first establish the relationship between the largest eigenvalue of the Laplacian matrix of a graph and its bipartite density. Then we present lower and upper bounds for the largest Laplacian eigenvalue of a graph in terms of its largest degree and diameter.
متن کاملComputing the Laplacian spectra of some graphs
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as the eigenvalues of symmetric tridiagonal matrices. In addition, we apply our result to obtain an upper and lower bounds for the Laplacian-energy-like invariant of these graphs. The class of graphs considered are obtained by copies of modified generalized Bethe trees (obtained by joining the vertice...
متن کاملLoose laplacian spectra of random hypergraphs
Let H = (V , E) be an r-uniform hypergraph with the vertex set V and the edge set E. For 1 ≤ s ≤ r/2, we define a weighted graph G(s) on the vertex set (Vs) as follows. Every pair of s-sets I and J is associated with a weight w(I , J), which is the number of edges in H containing I and J if I ∩ J = ∅, and 0 if I ∩ J = ∅. The s-th Laplacian L(s) of H is defined to be the normalized Laplacian of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2020
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2019.107281